翻訳と辞書 Words near each other ・ Jarotki ・ Jaroty, Gmina Stawiguda ・ Jaroudiah ・ Jarov ・ Jarov (Plzeň-North District) ・ Jarov (Plzeň-South District) ・ Jarovce ・ Jarovići (Goražde) ・ Jarovići (Rogatica) ・ Jarovnice ・ Jaroš ・ Jaroš Griemiller ・ Jarošov ・ Jarošov (Svitavy District) ・ Jarošov nad Nežárkou ・ Jaro–Winkler distance ・ Jarpice ・ Jarplund-Weding ・ Jarpnoonk ・ Jarqavieh ・ Jarqavieh Olya ・ Jarqavieh Olya District ・ Jarqavieh Olya Rural District ・ Jarqavieh Sofla ・ Jarqavieh Sofla District ・ Jarqavieh Sofla Rural District ・ Jarqavieh Vosta Rural District ・ Jarque ・ Jarque (disambiguation) ・ Jarque de la Val Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Jaro–Winkler distance ： ウィキペディア英語版 Jaro–Winkler distance In computer science and statistics, the Jaro–Winkler distance (Winkler, 1990) is a measure of similarity between two strings. It is a variant of the Jaro distance metric (Jaro, 1989, 1995), a type of string edit distance, and was developed in the area of record linkage (duplicate detection) (Winkler, 1990). The higher the Jaro–Winkler distance for two strings is, the more similar the strings are. The Jaro–Winkler distance metric is designed and best suited for short strings such as person names. The score is normalized such that 0 equates to no similarity and 1 is an exact match. == Definition == The Jaro distance $d\_j$ of two given strings $s\_1$ and $s\_2$ is : $d\_j\; =\; \backslash left\backslash$ 0 & \textm = 0\\ \frac\left(\frac + \frac + \frac\right) & \text \end \right. Where: * $m$ is the number of ''matching characters'' (see below); * $t$ is half the number of ''transpositions'' (see below). Two characters from $s\_1$ and $s\_2$ respectively, are considered ''matching'' only if they are the same and not farther than $\backslash left\backslash lfloor\backslash frac\backslash right\backslash rfloor-1$. Each character of $s\_1$ is compared with all its matching characters in $s\_2$. The number of matching (but different sequence order) characters divided by 2 defines the number of ''transpositions''. For example, in comparing CRATE with TRACE, only 'R' 'A' 'E' are the matching characters, i.e. m=3. Although 'C', 'T' appear in both strings, they are farther than 1, i.e., floor(5/2)-1=1. Therefore, t=0 . In DwAyNE versus DuANE the matching letters are already in the same order D-A-N-E, so no transpositions are needed. Jaro–Winkler distance uses a prefix scale $p$ which gives more favourable ratings to strings that match from the beginning for a set prefix length $\backslash ell$. Given two strings $s\_1$ and $s\_2$, their Jaro–Winkler distance $d\_w$ is: : $d\_w\; =\; d\_j\; +\; (\backslash ell\; p\; (1\; -\; d\_j))$ where: * $d\_j$ is the Jaro distance for strings $s\_1$ and $s\_2$ * $\backslash ell$ is the length of common prefix at the start of the string up to a maximum of 4 characters * $p$ is a constant scaling factor for how much the score is adjusted upwards for having common prefixes. $p$ should not exceed 0.25, otherwise the distance can become larger than 1. The standard value for this constant in Winkler's work is $p\; =\; 0.1$ Although often referred to as a ''distance metric'', the Jaro–Winkler distance is actually not a metric in the mathematical sense of that term because it does not obey the triangle inequality (). In fact the Jaro-Winkler distance also does not satisfy that axiom that states that $d(x,y)=0\; \backslash rightarrow\; x\; =\; y$. In some implementations of Jaro-Winkler, the prefix bonus $\backslash ell\; p\; (1\; -\; d\_j)$ is only added when the compared strings have a Jaro distance above a set "boost threshold" $b\_t$. The boost threshold in Winkler's implementation was 0.7. : $d\_w\; =\; \backslash left\backslash$ d_j & \textd_j < b_t\\ d_j + (\ell p (1 - d_j)) & \text \end \right. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Jaro–Winkler distance」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.